Small Triangle-Free Configurations of Points and Lines
نویسندگان
چکیده
In the paper we show that all combinatorial triangle-free configurations for v ≤ 18 are geometrically realizable. We also show that there is a unique smallest astral (183) triangle-free configuration and its Levi graph is the generalized Petersen graph G(18, 5). In addition, we present geometric realizations of the unique flag transitive triangle-free configuration (203) and the unique point transitive triangle-free configuration (213).
منابع مشابه
Visual Preferences of Small Urban Parks Based on Spatial Configuration of Place
The importance of small urban parks (SUP) in mega cities has been accepted as an essential component of urban lung and restorative settings. As urban population in the world increases and the cost of maintaining large parks escalates, urban authorities are shifting their attention to creating and maintaining smaller urban parks. However, SUP may present a different ambience due to their locatio...
متن کاملThe triangle chromatic index of Steiner triple systems
In a Steiner triple system of order v, STS(v), a set of three lines intersecting pairwise in three distinct points is called a triangle. A set of lines containing no triangle is called triangle-free. The minimum number of triangle-free sets required to partition the lines of a Steiner triple system S, is called the triangle chromatic index of S. We prove that for all admissible v, there exists ...
متن کاملA TAXICAB VERSION OF A TRIANGLE' S APOLLONIUS CIRCLE
One of the most famous problems of classical geometry is the Apollonius' problem asks construction of a circle which is tangent to three given objects. These objects are usually taken as points, lines, and circles. This well known problem was posed by Apollonius of Perga ( about 262 - 190 B.C.) who was a Greek mathematician known as the great geometer of ancient times after Euclid and Archimede...
متن کاملSome Configurations of Triangle Centers
Many collections of triangle centers and symmetrically defined triangle points are vertices of configurations. This illustrates a high level of organization among the points and their collinearities. Some of the configurations illustrated are inscriptable in Neuberg’s cubic curve and others arise from Monge’s theorem.
متن کاملAutomated Proofs in Geometry : Computing Upper Bounds for the Heilbronn Problem for Triangles
The Heilbronn problem for triangle[Wei] is defined as follows: place N points inside a triangle of unit area, so as to maximize the area of the smallest triangle obtained by choosing 3 points among N. Several authors worked towards finding lower bounds or optimal configurations of points. In this paper, we propose upper bounds for those problems, obtained by a method of automated theorem proving.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 35 شماره
صفحات -
تاریخ انتشار 2006